Exception-Tolerant Decision Tree / Rule Based Classifiers
نویسندگان
چکیده
منابع مشابه
Decision Tree Rule Reduction Using Linear Classifiers in Multilayer Perceptron
It has been shown that a neural network is better than a direct application of induction trees in modeling complex relations of input attributes in sample data. We propose that concise rules be extracted to support data with input variable relations over continuous-valued attributes. Those relations as a set of linear classifiers can be obtained from neural network modeling based on back-propag...
متن کاملAnomaly Detection using Decision Tree based Classifiers
as we know that with the help of Data mining techniques we can find out knowledge in terms of various characteristics and patterns. In this regard this paper presents finding out of anomalies/ outliers using various decision tree based classifiers viz. Best-first Decision Tree, Functional Tree, Logistic Model Tree, J48 and Random Forest decision tree. Three real world datasets has been used in ...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملSelection of Tree-based Classifiers with the Bootstrap 632+ Rule
15 wardly biased as with the standard bootstrap. The use of the bootstrap 632+ rule for model evaluation in this problem constitutes a rst real application of the method. Model prediction error for the selected CART compared favorably with that estimated by Fisher's linear discriminant function. Acknowledgments Collaboration with C. Chemini and the Centro di Ecologia Alpina of Trento is gratefu...
متن کاملDecision Degree-based Decision Tree Technology for Rule Extraction
Traditional rough set-based approaches to reduct have difficulties in constructing optimal decision tree, such as empty branches and over-fitting, selected attribute with more values, and increased expense of computational effort. It is necessary to investigate fast and effective search algorithms. In this paper, to address this issue, the limitations of current knowledge reduction for evaluati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ingénierie des systèmes d information
سال: 2019
ISSN: 1633-1311,2116-7125
DOI: 10.18280/isi.240514